Decision-Tree-Based Horizontal Fragmentation Method for Data Warehouses

نویسندگان

چکیده

Data warehousing gives frameworks and means for enterprise administrators to methodically prepare, comprehend, utilize the data improve strategic decision-making skills. One of principal challenges warehouse designers is fragmentation. Currently, several fragmentation approaches warehouses have been developed since this technique can decrease OLAP (online analytical processing) query response time it provides considerable benefits in table loading maintenance tasks. In paper, a horizontal method, called FTree, that uses decision trees fragment presented take advantage effectiveness classification. FTree determines queries with major relevance, evaluates predicates found workload, according this, builds tree select scheme. To verify design correct, SSB (star schema benchmark) was used first instance; later, tourist built, method tested on it. The results experiments proved efficacy method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bi - Objective Optimization Based on Compromise Method for Horizontal Fragmentation in Relational Data Warehouses

Generally, research that dealt with the selection problems for optimization techniques or structures in relational data ware houses supports these problems by considering only a single criterion of optimization. The optimization criteria may be the response time of query execution, the number of inputs/outputs between the main memory and the disk, the space allocated to store the index or mater...

متن کامل

Horizontal Fragmentation for Data Outsourcing with Formula-Based Confidentiality Constraints

This article introduces the notion of horizontal fragmentation to the data outsourcing area. In a horizontal fragmentation, rows of tables are separated (instead of columns for vertical fragmentation). We give a formula-based definition of confidentiality constraints and an implication-based definition of horizontal fragmentation correctness. Then we apply the chase procedure to decide this cor...

متن کامل

Web Service for Incremental and Automatic Data Warehouses Fragmentation

The data warehouses (DW) are proposed to collect and store heterogeneous and bulky data. They represent a collection of thematic, integrated, non-volatile and histories data. They are fed from different data sources through transactional queries and offer analytical data through decisional queries. Generally, the decisional queries execution cost on large tables is very high. Reducing this cost...

متن کامل

A hybrid decision tree/genetic algorithm method for data mining

This paper addresses the well-known classification task of data mining, where the objective is to predict the class which an example belongs to. Discovered knowledge is expressed in the form of high-level, easy-to-interpret classification rules. In order to discover classification rules, we propose a hybrid decision tree/genetic algorithm method. The central idea of this hybrid method involves ...

متن کامل

A New Decision Tree Method for Data Mining in Medicine

Today, enormous amount of data is collected in medical databases. These databases may contain valuable information encapsulated in nontrivial relationships among symptoms and diagnoses. Extracting such dependencies from historical data is much easier to done by using medical systems. Such knowledge can be used in future medical decision making. In this paper, a new algorithm based on C4.5 to mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2022

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app122110942